The Evolution of Transitive Constructions in Austronesian
ثبت نشده
چکیده
The AN comparative grammarian is favored by the large number of surviving daughter languages offering comparative testimony but handicapped by the apparently great diversity of case-marking systems among these languages, by problems in characterizing the structure of their case-marking systems, by igThe excellent work of Dahl (1973, Ch. 22) and Wolff (1973) deals with some of the same problems as we do. However, the PAN reconstructions they propose rest on evidence cited from a restricted sample of typologically rather homogeneous western AN languages. Thus, the PAN status of their reconstructions can be questioned, while the problem remains of accounting for the divergent daughter systems.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملSocial complexity and linguistic diversity in the Austronesian and Bantu population expansions.
Reconstructing the rise and fall of social complexity in human societies through time is fundamental for understanding some of the most important transformations in human history. Phylogenetic methods based on language diversity provide a means to reconstruct pre-historic events and model the transition rates of cultural change through time. We model and compare the evolution of social complexi...
متن کاملProduct constructions for transitive decompositions of graphs
A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition is a decomposition which is highly symmetrical, in the sense that the subgraphs are preserved and transitively permuted by a group of automorphisms of the graph. This paper describes some ‘product’ constructions for transitive decompositions of graphs, and shows how these may be used...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملWeakly Distance-Regular Digraphs of Girth 2
In this paper, we give two constructions of weakly distance-regular digraphs of girth 2, and prove that certain quotient digraph of a commutative weakly distancetransitive digraph of girth 2 is a distance-transitive graph. As an application of the result, we not only give some constructions of weakly distance-regular digraphs which are not weakly distance-transitive, but determine a special cla...
متن کامل